Parallel Architectures for Searching the MEDLINE Database

نویسندگان

  • Rajendra V. Boppana
  • Suresh Chalasani
  • Bob Badgett
  • Jacqueline A. Pugh
چکیده

The MEDLINE database, an online archival of medical research publications, is extensively used by physicians, clinicians and other medical researchers for literature search and information on prior case studies. The size of MEDLINE database is over 40GB. The PubMed is an implementation of MEDLINE and provides basic search capabilities freely via the Internet. The initial search often tends to return excessive irrelevant pointers; so researchers often need to conduct additional searches to refine the search data. In this paper, we will investigate a parallel architecture for searching the MEDLINE database, which is unique compared to the existing MEDLINE implementations. The proposed architecture will implement MEDLINE on a cluster of Personal Computers (PCs). This architecture (i) allows for refinement of searches, (ii) reduces the search time for the users, and (iii) increases the availability of the system. We present design guidelines to select the cluster configuration and an analytical model to predict performance improvements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

واکسیناسیون دندانپزشکان و مراقبین بهداشت دهان و دندان

Oral health care workers may be exposed to a variety of infectious agents as they carry out their professional responsibilities. Dentists must recognize diseases that are most commonly transmitted in dental offices. Oral health care providers should assess their needs for immunization based on the characteristics of their clinical work setting and own risk-taking profile. Relevant articles in t...

متن کامل

GRAPES: A Software for Parallel Searching on Biological Graphs Targeting Multi-Core Architectures

Biological applications, from genomics to ecology, deal with graphs that represents the structure of interactions. Analyzing such data requires searching for subgraphs in collections of graphs. This task is computationally expensive. Even though multicore architectures, from commodity computers to more advanced symmetric multiprocessing (SMP), offer scalable computing power, currently published...

متن کامل

Parallel Search On Video Cards

Recent approaches exploiting the massively parallel architecture of graphics processors (GPUs) to accelerate database operations have achieved intriguing results. While parallel sorting received significant attention, parallel search has not been explored. With p-ary search we present a novel parallel search algorithm for large-scale database index operations that scales with the number of proc...

متن کامل

An Index Data Structure for Searching in Metric Space Databases

This paper presents the Evolutionary Geometric Near-neighbor Access Tree (EGNAT) which is a new data structure devised for searching in metric space databases. The EGNAT is fully dynamic, i.e., it allows combinations of insert and delete operations, and has been optimized for secondary memory. Empirical results on different databases show that this tree achieves good performance for high-dimens...

متن کامل

Data-Centric Computing with the Netezza Architecture

While relational databases have become critically important in business applications and web services, they have played a relatively minor role in scientific computing, which has generally been concerned with modeling and simulation activities. However, massively parallel database architectures are beginning to offer the ability to quickly search through terabytes of data with hundred-fold or e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006